Least Squares Estimation Based SDP Cuts for SOCP Relaxation of AC OPF

Using the eigenvalue relaxation for binary least-squares estimation problems

The goal of this paper is to survey the properties of the eigenvalue relaxation for least squares binary problems. This relaxation is a convex program which is obtained as the Lagrangian dual of the original problem with an implicit compact constraint and as such, is a convex problem with polynomial time complexity. Moreover, as a main pratical advantage of this relaxation over the standard Sem...

Generalized least squares-based parametric motion estimation

The estimation of parametric global motion had a significant attention during the last two decades, but despite the great efforts invested, there are still open issues. The most important ones are related to the accuracy of the estimation and to the ability to recover large deformation between images. In this paper, a new generalized least squares-based motion estimator is proposed. The non-lin...

Strong SOCP Relaxations for the Optimal Power Flow Problem

This paper proposes three strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem. These three relaxations are incomparable to each other and two of them are incomparable to the standard SDP relaxation of OPF. Extensive computational experiments show that these relaxations have numerous advantages over existing convex relaxations in the literature: (i...

​Rank based Least-squares Independent Component Analysis

  In this paper, we propose a nonparametric rank-based alternative to the least-squares independent component analysis algorithm developed. The basic idea is to estimate the squared-loss mutual information, which used as the objective function of the algorithm, based on its copula density version. Therefore, no marginal densities have to be estimated. We provide empirical evaluation of th...

Least Squares Estimation